Free variables and bound variables - PDFSEARCH.IO - Document Search Engine

Free variables and bound variables
Results: 147

#	Item
51	A Tabling Implementation Based on Variables with Multiple Bindings Pablo Chico de Guzm´an1 Manuel Carro1 Manuel V. Hermenegildo1,2 {mcarro,herme}@fi.upm.es Add to Reading List Source URL: www.clip.dia.fi.upm.es Language: English - Date: 2009-05-02 05:38:03 Type theory Variables Prolog Backtracking MOS Technology SID Assignment Pointer Free variables and bound variables Stack Computing Software engineering Data types
52	Bottom-up β-reduction: uplinks and λ-DAGs∗ (extended version) Olin Shivers† Georgia Institute of Technology Add to Reading List Source URL: www.ccs.neu.edu Language: English - Date: 2005-04-26 17:10:34 Computing Lambda calculus Directed acyclic graph Tree B-tree Free variables and bound variables T-tree Combinatory logic R-tree Graph theory Mathematics Binary trees
53	CS109B Notes for LecturePredicates Essentially Boolean-valued functions with arguments of arbitrary type. But predicates are uninterpreted; a predicate named , for example, need not givethe value TRUE. Add to Reading List Source URL: infolab.stanford.edu Language: English - Date: 2008-09-19 00:59:19 Predicate logic First-order logic Free variables and bound variables Function Universal quantification Predicate FO Propositional variable Independence Logic Mathematical logic Mathematics
54	Bottom-up β-reduction: uplinks and λ-DAGs (journal version) June 29, 2010 Olin Shivers Add to Reading List Source URL: www.ccs.neu.edu Language: English - Date: 2010-07-08 22:05:21 Mathematics Lambda calculus Directed acyclic graph B-tree Tree traversal Tree Free variables and bound variables T-tree Linked list Graph theory Binary trees Computing
55	Higher-Order and Symbolic Computation manuscript No. (will be inserted by the editor) Compilation of extended recursion in call-by-value functional languages Tom Hirschowitz · Xavier Leroy · J. B. Wells Add to Reading List Source URL: gallium.inria.fr Language: English - Date: 2009-12-15 04:49:16 Computability theory Recursion Theoretical computer science Models of computation Formal methods Lambda calculus Standard ML Free variables and bound variables Scheme Software engineering Computing Mathematics
56	Higher-Order and Symbolic Computation manuscript No. (will be inserted by the editor) Compilation of extended recursion in call-by-value functional languages Tom Hirschowitz · Xavier Leroy · J. B. Wells Add to Reading List Source URL: pauillac.inria.fr Language: English - Date: 2009-12-15 04:49:16 Computability theory Recursion Theoretical computer science Models of computation Formal methods Lambda calculus Standard ML Free variables and bound variables Scheme Software engineering Computing Mathematics
57	Flow-Sensitive Type Recovery in Linear-Log Time Michael D. Adams ∗ , Andrew W. Keep∗ , Jan Midtgaard† , Matthew Might‡ , Arun Chauhan∗ , R. Kent Dybvig∗ Abstract the cost of run-time type checks. This cost c Add to Reading List Source URL: www.cs.indiana.edu Language: English - Date: 2012-04-14 12:13:51 Models of computation Logic Mathematical logic Function Data-flow analysis Free variables and bound variables Algorithm Lambda calculus Monad Mathematics Elementary mathematics Theoretical computer science
58	PDF Document Add to Reading List Source URL: www.cl.cam.ac.uk Language: English - Date: 2014-08-27 06:04:04 Model theory Predicate logic Skolem normal form Counterexample Free variables and bound variables Universal quantification Function American English Mathematics Logic Mathematical logic
59	A Language for Automatically Enforcing Privacy Policies Jean Yang Kuat Yessenov Armando Solar-Lezama Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2012-01-04 11:40:01 Type theory Data types Predicate logic Models of computation Symbol Variable Local consistency Lambda calculus Free variables and bound variables Mathematics Mathematical logic Logic